BYZANTINE STUDIES
نویسندگان
چکیده
منابع مشابه
Studies on Verifiable Secret Sharing, Byzantine Agreement and Multiparty Computation
This dissertation deals with three most important as well as fundamental problems in secure distributed computing, namely Verifiable Secret Sharing (VSS), Byzantine Agreement (BA) and Multiparty Computation (MPC). VSS is a two phase protocol (Sharing and Reconstruction) carried out among n parties in the presence of a centralized adversary who can corrupt up to t parties. Informally, the goal o...
متن کاملByzantine Fireflies
This paper addresses the problem of synchronous beeping, as addressed by swarms of fireflies. We present Byzantine-resilient algorithms ensuring that the correct processes eventually beep synchronously despite a subset of nodes beeping asynchronously. We assume that n > 2f (n is the number of processes and f is the number of Byzantine processes) and that the initial state of the processes can b...
متن کاملMaking Byzantine Fault Tolerant Systems Tolerate Byzantine Faults
This paper argues for a new approach to building Byzantine fault tolerant systems. We observe that although recently developed BFT state machine replication protocols are quite fast, they don’t actually tolerate Byzantine faults very well: a single faulty client or server is capable of rendering PBFT, Q/U, HQ, and Zyzzyva virtually unusable. In this paper, we (1) demonstrate that existing proto...
متن کاملExtending Binary Byzantine Agreement to Multivalued Byzantine Agreement
The concern of this paper is a set of potentially faulty processes that engage in a distributed computation to agree on some piece of information. Each process enters the computation with an initial value. The computation returns a common result value to each correct process. If all correct processes begin the computation with identical initial values, then the result value equals the initial v...
متن کاملOptimistic Asynchronous Byzantine Agreement
Agreement problems are a fundamental building block for constructing reliable distributed systems. While robust and eÆcient protocols exist in the crash-failure setting, protocols resilient against a Byzantine adversary tend to have problems with either eÆciency or security. This paper proposes an optimistic approach to the Byzantine agreement problem, combining the eÆciency of fully synchronou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Orient
سال: 2001
ISSN: 1884-1392,0473-3851
DOI: 10.5356/orient1960.36.123